package leecode;

/**
 * 功能描述：打印最大的n位数数字
 *
 * @Author: lwg
 * @Date: 2021/4/27 18:39
 */
public class demo18 {

    public static void main(String[] args) {
        int end = (int)mypow(10, 1) - 1;
        int[] res = new int[end];
        for (int j = 0; j < end; j++) {
            res[j]=j+1;
        }

        for (int i=0;i<end;i++){
            System.out.println(res[i]);
        }
    }
    public static int mypow(int x,int n){
        if(x<=0){
            return 0;
        }
        long b=n;
        int res=1;
        if(b<0){
            x=1/x;
            b=-b;
        }
        while(b>0){
            if((b&1)==1){
                res= res*x;
            }
            x*=x;
            b>>=1;
        }
        return res;

    }

}
